Declarative Programming for Modular Robots
نویسندگان
چکیده
Because of the timing, complexity, and asynchronicity challenges common in modular robot software we have recently begun to explore new programming models for modular robot ensembles. In this paper we apply two of those models to a metamodule-based shape planning algorithm and comment on the differences between the two approaches. Our results suggest that declarative programming can provide several advantages over more traditional imperative approaches, and that the differences between declarative programming styles can themselves contribute leverage to different parts of the problem domain.
منابع مشابه
Using Genetic Programming to Design Decentralized Controllers for Self-Reconfigurable Modular Robots
Advantages of self-reconfigurable modular robots over conventional robots include physical adaptability, robustness in the presence of failures, and economies of scale. Creating control software for modular robots is one of the central challenges to realizing their potential advantages. Modular robots differ enough from traditional robots that new techniques must be found to create software to ...
متن کاملDesign of Decentralized Controllers for Self-Reconfigurable Modular Robots Using Genetic Programming
Advantages of self-reconfigurable modular robots over conventional robots include physical adaptability, robustness in the presence of failures, and economies of scale. Creating control software for modular robots is one of the central challenges to realizing their potential advantages. Modular robots differ enough from traditional robots that new techniques must be found to create software to ...
متن کاملA Language for Modular Answer Set Programming: Application to ACC Tournament Scheduling
In this paper we develop a declarative language for modular answer set programming (ASP). Our language allows to declaratively state how one ASP module can import processed answer sets from another ASP module. We define the syntax and semantics of our language and illustrate its applicability by modeling the ACC tournament scheduling problem. Besides the elegance of developing declarative progr...
متن کاملIntegrating Declarative Programming and Probabilistic Planning for Robots
Mobile robots deployed in complex real-world domains typically find it difficult to process all sensor inputs or operate without substantial domain knowledge. At the same time, humans may not have the time and expertise to provide elaborate and accurate knowledge or feedback. The architecture described in this paper combines declarative programming and probabilistic sequential decision-making t...
متن کاملPushing the Envelope: Programming Reasoning Agents
Formal theories of actions have evolved in recent years into high-level programming languages for robots. While these languages allow to implement complex strategies in a declarative, concise and modular fashion, they are often doubted to be sufficiently efficient for practical purposes. In this paper we push the envelope of reasoning agents, thereby making a case for state-based solutions to t...
متن کامل